A cut-and-branch algorithm for the Quadratic Knapsack Problem

The Quadratic Knapsack Problem (QKP) is a well-known NP-hard combinatorial optimisation problem, with many practical applications. We present ‘cut-and-branch’ algorithm for the QKP, in which cutting-plane phase followed by branch-and-bound phase. more sophisticated than existing ones literature, incorporating several classes of cutting planes, two primal heuristics, and rules eliminating variables constraints. Computational results show that competitive.